-
1 последовательная маршрутизация
Russian-English dictionary of telecommunications > последовательная маршрутизация
-
2 технологический маршрут
2) Engineering: flow, operation-routing sequence, process flow, road, route, routing, schedule, throughput sequence3) Economy: flow route4) Metallurgy: method of procedure5) Mechanics: manufacturing route, manufacturing routing, manufacturing sequence, path flow, processing route, routing sequence, sequential routing6) Automation: job plan, manufacturing plan, operational order, process plan, process route, processing sequence, production flow, work flow7) Robots: processing route (детали)Универсальный русско-английский словарь > технологический маршрут
-
3 технологический маршрут
path flow, process flow, work flow, operational order, job plan, manufacturing plan, process plan, manufacturing route, route, manufacturing routing, sequential routing, routing, manufacturing sequence, operation-routing sequence, processing sequence, routing sequence, throughput sequenceРусско-английский исловарь по машиностроению и автоматизации производства > технологический маршрут
-
4 последовательная маршрутизация
1) Information technology: hop-by-hop routing2) Network technologies: sequential routing, serial routingУниверсальный русско-английский словарь > последовательная маршрутизация
См. также в других словарях:
Destination routing — is a term used in telecommunications to define a sequential pathway that messages must pass through to reach a target destination. Overview In the context of telephone switching systems for circuit based calls, the destination stations are… … Wikipedia
Communications protocol — For other senses of this word, see Protocol. A communications protocol is a system of digital message formats and rules for exchanging those messages in or between computing systems and in telecommunications. A protocol may have a formal… … Wikipedia
Abkürzungen/Computer — Dies ist eine Liste technischer Abkürzungen, die im IT Bereich verwendet werden. A [nach oben] AA Antialiasing AAA authentication, authorization and accounting, siehe Triple A System AAC Advanced Audio Coding AACS … Deutsch Wikipedia
Liste der Abkürzungen (Computer) — Dies ist eine Liste technischer Abkürzungen, die im IT Bereich verwendet werden. A [nach oben] AA Antialiasing AAA authentication, authorization and accounting, siehe Triple A System AAC Advanced Audio Coding AACS … Deutsch Wikipedia
Einstein (programming language) — Introduction Einstein is an open source forth generation programming language (4GL) written on top of the Deesel 3GL programming language. It is a flow based programming language supporting message based constructs such… … Wikipedia
List of computing and IT abbreviations — This is a list of computing and IT acronyms and abbreviations. Contents: 0–9 A B C D E F G H I J K L M N O P Q R S T U V W X Y … Wikipedia
computer science — computer scientist. the science that deals with the theory and methods of processing information in digital computers, the design of computer hardware and software, and the applications of computers. [1970 75] * * * Study of computers, their… … Universalium
Parallel computing — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing … Wikipedia
Luleå algorithm — The Luleå algorithm, designed by harvtxt|Degermark|Brodnik|Carlsson|Pink|1997, is a patented technique for storing and searching internet routing tables efficiently. It is named after the Luleå University of Technology, the home institute of the… … Wikipedia
Voice over IP — Digital voice redirects here. For the commercial service, see Comcast Digital Voice. Voice over Internet Protocol (Voice over IP, VoIP) is a family of technologies, methodologies, communication protocols, and transmission techniques for the… … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia